Exactly Solvable Random Graph Ensemble with Extensively Many Short Cycles
نویسندگان
چکیده
Fabián Aguirre López, Paolo Barucca, Mathilde Fekom, and Anthony CC Coolen Department of Mathematics, King’s College London, The Strand, London WC2R 2LS, United Kingdom Institute for Mathematical and Molecular Biomedicine, King’s College London, Hodgkin Building, London SE1 1UL, United Kingdom London Institute for Mathematical Sciences, 35a South St, Mayfair, London W1K 2XF, United Kingdom University of Zürich, Department of Banking and Finance, Zürich, ZH, Switzerland UFR de Physique, Université Paris Diderot (Paris 7), 5 Rue Thomas Mann, 75013 Paris, France
منابع مشابه
Random Graph Ensembles with Many Short Loops
Networks observed in the real world often have many short loops. This violates the treelike assumption that underpins the majority of random graph models and most of the methods used for their analysis. In this paper we sketch possible research routes to be explored in order to make progress on networks with many short loops, involving old and new random graph models and ideas for novel mathema...
متن کاملAn exactly solvable random satisfiability problem
We introduce a new model for the generation of random satisfiability problems. It is an extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina, which is a variant of the famous K-SAT model: it is extended to q-state variables and relates to a different choice of the statistical ensemble. The model has an exactly solvable statistic: the critical exponents and scaling functions o...
متن کاملExpected numbers at hitting times
We determine exactly the expected number of hamilton cycles in the random graph obtained by starting with n isolated vertices and adding edges at random until each vertex degree is at least two. This complements recent work of Cooper and Frieze. There are similar results concerning expected numbers for example of perfect matchings, spanning trees, hamilton paths and directed hamilton cycles.
متن کاملEquitable random graphs
Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdős and Rényi, in particular, as well as the so-called configuration model, have served as the starting point for numerous calculations. In this paper we describe another large class of random graph models, which we call equitable random graphs and which are flexible enou...
متن کاملRandom Graphs as Models of Networks
The random graph of Erdős and Rényi is one of the oldest and best studied models of a network, and possesses the considerable advantage of being exactly solvable for many of its average properties. However, as a model of real-world networks such as the Internet, social networks or biological networks it leaves a lot to be desired. In particular, it differs from real networks in two crucial ways...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017